<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>LibCDS: BalancedTree Struct Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">LibCDS
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li><a href="functions.html"><span>Data&#160;Fields</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('structBalancedTree.html','');});
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#pub-attribs">Data Fields</a>  </div>
  <div class="headertitle">
<div class="title">BalancedTree Struct Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>The implementation for basic binary search tree.  
 <a href="structBalancedTree.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a5db575df7f25b6d5a751a101aeaf9b2c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="balanced__tree_8h.html#aa1bb86c6b97f263892ec7f2e1c21229d">BalTreeData</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#a5db575df7f25b6d5a751a101aeaf9b2c">pData</a></td></tr>
<tr class="memdesc:a5db575df7f25b6d5a751a101aeaf9b2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The container private information.  <a href="#a5db575df7f25b6d5a751a101aeaf9b2c">More...</a><br/></td></tr>
<tr class="separator:a5db575df7f25b6d5a751a101aeaf9b2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9f0f505e2fa01b21a5e1ca572da4e462"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#a9f0f505e2fa01b21a5e1ca572da4e462">insert</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, bool)</td></tr>
<tr class="memdesc:a9f0f505e2fa01b21a5e1ca572da4e462"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert an item into the tree.  <a href="#a9f0f505e2fa01b21a5e1ca572da4e462">More...</a><br/></td></tr>
<tr class="separator:a9f0f505e2fa01b21a5e1ca572da4e462"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a93df5d804b7863e44f41651f7f273af7"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#a93df5d804b7863e44f41651f7f273af7">search</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a93df5d804b7863e44f41651f7f273af7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search for the the item having the same order with the designated one.  <a href="#a93df5d804b7863e44f41651f7f273af7">More...</a><br/></td></tr>
<tr class="separator:a93df5d804b7863e44f41651f7f273af7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8503a605422d0f861cbe853bbf74872"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#aa8503a605422d0f861cbe853bbf74872">delete</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, bool)</td></tr>
<tr class="memdesc:aa8503a605422d0f861cbe853bbf74872"><td class="mdescLeft">&#160;</td><td class="mdescRight">Delete the item having the same order with the designated one.  <a href="#aa8503a605422d0f861cbe853bbf74872">More...</a><br/></td></tr>
<tr class="separator:aa8503a605422d0f861cbe853bbf74872"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a21515b0934cd4e317bfc4291410cc955"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#a21515b0934cd4e317bfc4291410cc955">maximum</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a21515b0934cd4e317bfc4291410cc955"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the item having the maximum order of the tree.  <a href="#a21515b0934cd4e317bfc4291410cc955">More...</a><br/></td></tr>
<tr class="separator:a21515b0934cd4e317bfc4291410cc955"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adbd8ed95e039a9e2f9d078c3b66a585e"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#adbd8ed95e039a9e2f9d078c3b66a585e">minimum</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:adbd8ed95e039a9e2f9d078c3b66a585e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the item having the minimum order of the tree.  <a href="#adbd8ed95e039a9e2f9d078c3b66a585e">More...</a><br/></td></tr>
<tr class="separator:adbd8ed95e039a9e2f9d078c3b66a585e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae20f2b13c97531a6f46a62bdbc87664f"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#ae20f2b13c97531a6f46a62bdbc87664f">successor</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:ae20f2b13c97531a6f46a62bdbc87664f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the immediate successor of the designated item.  <a href="#ae20f2b13c97531a6f46a62bdbc87664f">More...</a><br/></td></tr>
<tr class="separator:ae20f2b13c97531a6f46a62bdbc87664f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa86d36b76ecb3b80b024628051e1c6e4"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#aa86d36b76ecb3b80b024628051e1c6e4">predecessor</a> )(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:aa86d36b76ecb3b80b024628051e1c6e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the immediate predecessor of the designated item.  <a href="#aa86d36b76ecb3b80b024628051e1c6e4">More...</a><br/></td></tr>
<tr class="separator:aa86d36b76ecb3b80b024628051e1c6e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afe89397bdf236912f2c1a4db33e7d0e6"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#afe89397bdf236912f2c1a4db33e7d0e6">size</a> )(struct _BalancedTree *)</td></tr>
<tr class="memdesc:afe89397bdf236912f2c1a4db33e7d0e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the number of stored item.  <a href="#afe89397bdf236912f2c1a4db33e7d0e6">More...</a><br/></td></tr>
<tr class="separator:afe89397bdf236912f2c1a4db33e7d0e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a72766d3248f386fa3a7d3095e82109f1"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#a72766d3248f386fa3a7d3095e82109f1">set_compare</a> )(struct _BalancedTree *, int32_t(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td></tr>
<tr class="memdesc:a72766d3248f386fa3a7d3095e82109f1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the user defined item comparison method.  <a href="#a72766d3248f386fa3a7d3095e82109f1">More...</a><br/></td></tr>
<tr class="separator:a72766d3248f386fa3a7d3095e82109f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaa051e98b5cde99b0959e4f3bb6ae2a3"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBalancedTree.html#aaa051e98b5cde99b0959e4f3bb6ae2a3">set_destroy</a> )(struct _BalancedTree *, void(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td></tr>
<tr class="memdesc:aaa051e98b5cde99b0959e4f3bb6ae2a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the user defined item clean method.  <a href="#aaa051e98b5cde99b0959e4f3bb6ae2a3">More...</a><br/></td></tr>
<tr class="separator:aaa051e98b5cde99b0959e4f3bb6ae2a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>The implementation for basic binary search tree. </p>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00014">14</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>
</div><h2 class="groupheader">Field Documentation</h2>
<a class="anchor" id="a5db575df7f25b6d5a751a101aeaf9b2c"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="balanced__tree_8h.html#aa1bb86c6b97f263892ec7f2e1c21229d">BalTreeData</a>* BalancedTree::pData</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>The container private information. </p>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00016">16</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a9f0f505e2fa01b21a5e1ca572da4e462"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::insert)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, bool)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Insert an item into the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#acddaad9856ae3fc41c08da5df2db0f2e" title="Insert an item into the tree. ">BalTreeInsert</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00020">20</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a93df5d804b7863e44f41651f7f273af7"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::search)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Search for the the item having the same order with the designated one. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#af3911865cb73bf3ea45525426b97fa52" title="Search for the item having the same order with the designated one. ">BalTreeSearch</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00024">24</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="aa8503a605422d0f861cbe853bbf74872"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::delete)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, bool)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Delete the item having the same order with the designated one. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#acd14e9c38c89528f325cebe95cddd111" title="Delete the item having the same order with the designated one. ">BalTreeDelete</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00028">28</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a21515b0934cd4e317bfc4291410cc955"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::maximum)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the item having the maximum order of the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#a596d8a7f0d03ff81e75b8785c0de6d6c" title="Return the item having the maximum order of the tree. ">BalTreeMaximum</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00032">32</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="adbd8ed95e039a9e2f9d078c3b66a585e"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::minimum)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the item having the minimum order of the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#ad142b6cc379f0cc09235c6f0b468c49c" title="Return the item having the minimum order of the tree. ">BalTreeMinimum</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00036">36</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="ae20f2b13c97531a6f46a62bdbc87664f"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::successor)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the immediate successor of the designated item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#abab6aa3ebf18810d6075f2edc91962cd" title="Return the item which is the immediate successor of the designated item. ">BalTreeSuccessor</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00040">40</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="aa86d36b76ecb3b80b024628051e1c6e4"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::predecessor)(struct _BalancedTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the immediate predecessor of the designated item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#a6e71a7579736a9d6c5905229e82f6f68" title="Return the item which is the immediate predecessor of the designated item. ">BalTreePredecessor</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00044">44</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="afe89397bdf236912f2c1a4db33e7d0e6"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::size)(struct _BalancedTree *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the number of stored item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#a0d9cca0ffa93caab712b7f1928e0828a" title="Return the number of stored items. ">BalTreeSize</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00048">48</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a72766d3248f386fa3a7d3095e82109f1"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::set_compare)(struct _BalancedTree *, int32_t(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Set the user defined item comparison method. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#a35f67d31ffe8ca6b7cb5c7fc1efdd86b" title="Set the user defined item comparison method. ">BalTreeSetCompare</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00052">52</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="aaa051e98b5cde99b0959e4f3bb6ae2a3"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BalancedTree::set_destroy)(struct _BalancedTree *, void(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Set the user defined item clean method. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="balanced__tree_8h.html#a51722316496cd80a804614cb2f1e983d" title="Set the user defined item clean method. ">BalTreeSetDestroy</a> </dd></dl>

<p>Definition at line <a class="el" href="balanced__tree_8h_source.html#l00056">56</a> of file <a class="el" href="balanced__tree_8h_source.html">balanced_tree.h</a>.</p>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="structBalancedTree.html">BalancedTree</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
